On the distribution of the domination number for random class cover catch digraphs
نویسندگان
چکیده
In this article we initiate the study of class cover catch digraphs, a special case of intersection digraphs motivated by applications in machine learning and statistical pattern recognition. Our main result is the exact distribution of the domination number for a data-driven model of random interval catch digraphs. c © 2001 Elsevier Science B.V. All rights reserved
منابع مشابه
The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data
For two or more classes of points in Rd with d ≥ 1, the class cover catch digraphs (CCCDs) can be constructed using the relative positions of the points from one class with respect to the points from one or all of the other classes. The CCCDs were introduced by Priebe et al. [C.E. Priebe, J.G. DeVinney, D.J. Marchette, On the distribution of the domination number of random class catch cover dig...
متن کاملThe Use of Domination Number of a Random Proximity Catch Digraph for Testing Spatial Patterns of Segregation and Association
Priebe et al. (2001) introduced the class cover catch digraphs and computed the distribution of the domination number of such digraphs for one dimensional data. In higher dimensions these calculations are extremely difficult due to the geometry of the proximity regions; and only upper-bounds are available. In this article, we introduce a new type of data-random proximity map and the associated ...
متن کاملSpatial Clustering Tests Based on Domination Number of a New Random Digraph Family
We use the domination number of a parametrized random digraph family called proportional-edge proximity catch digraphs (PCDs) for testing multivariate spatial point patterns. This digraph family is based on relative positions of data points from various classes. We extend the results on the distribution of the domination number of proportional-edge PCDs, and use the domination number as a stati...
متن کاملA Visualization Framework for the Analysis of Hyperdimensional Data
The purpose of this article is to describe a new visualization framework for the analysis of hyperdimensional data. This framework was developed in order to facilitate the study of a new class of classifiers designated class cover catch digraphs. The class cover catch digraph is an original random graph technique for the construction of classifiers on high dimensional data. This framework allow...
متن کاملExtension of one-dimensional proximity regions to higher dimensions
Proximity maps and regions are defined based on the relative allocation of points from two or more classes in an area of interest and are used to construct random graphs called proximity catch digraphs (PCDs) which have applications in various fields. The simplest of such maps is the spherical proximity map which maps a point from the class of interest to a disk centered at the same point with ...
متن کامل